Ontology's Crossed Life Cycles

نویسندگان

  • Mariano Fernández-López
  • Asunción Gómez-Pérez
  • María Dolores Rojas Amaya
چکیده

This paper presents the idea that the life cycle of an ontology is highly impacted as a result of the process of reusing it for building another ontology. One of the more important results of the experiment presented is how the different activities to be carried out during the development of a specific ontology may involve performing other types of activities on other ontologies already built or under construction. We identify in that paper new intradependencies between activities carried out inside the same otology and interdependencies between activities carried out in different ontologies. The interrelation between life cycles of several ontologies provokes that integration has to be approached globally rather than as a mere integration of out implementation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Crossed-inverse quasigroups with long inverse cycles and applications to cryptography

In this paper, we show that crossed-inverse quasigroups have certain properties which make them particularly appropriate for use in cryptography. In particular, we provide a construction for crossed-inverse quasigroups with long inverse cycles and describe some applications.

متن کامل

A systematic approach for finding Hamiltonian cycles with a prescribed edge in crossed cubes

The crossed cube is one of the most notable variations of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is almost the half of that of the hypercube. In this paper, we focus on the problem embedding a Hamiltonian cycle through an arbitrary given edge in the crossed cube. We give necessary and sufficient condition f...

متن کامل

A Linear Algorithm for Embedding of Cycles in Crossed Cubes with Edge-Pncyclic

A cycle structure is a fundamental network for multiprocessor systems and suitable for developing simple algorithms with low communication cost. Many efficient algorithms were designed with respect to cycles for solving a variety of algebraic problems, graph problems, and some parallel applications, such as those in image and signal processing [2, 16]. To carry out a cycle-structure algorithm o...

متن کامل

Adult timing after preweaning shifts of Zeitgeber in rats: crossed sensitization to time?

Preweaning albino rats were exposed from days 1 to 18 of life to successive 6-h shifts in light and temperature Zeitgebers, (1-18 rats), whereas controls (C) were raised under constant 12:12 L:D and temperature cycles. Cyclic Peak Interval performance at adulthood (100 days) showed that 1-18 rats were more accurate and sensitive to time than C subjects. These effects, which were akin to a cross...

متن کامل

Edge Congestion and Topological Properties of Crossed Cubes

An dimensional crossed cube, CQ,,, is a variation of hypercubes. in this paper, we give a new shortest path routing algorithm based on a new distance measure defined hsreln. In comparison with Efe's algorithm, which generates one shortest path in O(ri2) time, our algorithm can generate more shortest paths in O ( n ) time. Based on a given shortest path routing algorithm, we consider a new perfo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000